On the Based Folding of Based Graphs

نویسنده

  • E. H. Hamouda
چکیده

In [6] , Nada S. and Hamouda E. defined the folding number, F (G), to be the order of the set of all folding maps of G into itself. Also they introduced a formula to compute the folding number of Pn, a path with n edges. In this paper, the concept of based folding of a based graph is introduced and the number of based folding F (Pn, v) is given. Mathematics Subject Classification: 05C30

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extended graphs based on KM-fuzzy metric spaces

This paper,  applies the concept  of KM-fuzzy metric spaces and  introduces a novel concept of KM-fuzzy metric  graphs based on KM-fuzzy metric spaces.  This study, investigates the finite KM-fuzzy metric spaces with respect to metrics and KM-fuzzy metrics and constructs KM-fuzzy metric spaces on any given non-empty sets. It tries to  extend   the concept of KM-fuzzy metric spaces to  a larger ...

متن کامل

Secret Sharing Based On Cartesian product Of Graphs

The purpose of this paper is to study the information ratio of perfect secret sharing of product of some special families of graphs. We seek to prove that the information ratio of prism graphs $Y_{n}$ are equal to $frac{7}{4}$ for any $ngeq 5$, and we will gave a partial answer to a question of Csirmaz cite{CL}. We will also study the information ratio of two other families $C_{m}times C_{n}$ a...

متن کامل

A NEW MULTIPLE CRITERIA DECISION-MAKING METHOD BASED ON BIPOLAR FUZZY SOFT GRAPHS

In this research study, we present a novel frame work for handling bipolar fuzzy soft information by combining bipolar fuzzy soft sets with graphs. We introduce several basic notions concerning bipolar fuzzy soft graphs and investigate some related properties. We also consider the application of the bipolar fuzzy soft graphs. In particular, three efficient algorithms are developed to solve mult...

متن کامل

On the M-polynomial of planar chemical graphs

Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...

متن کامل

Investigation of folding lateral growth using study of erosional processes and geomorphological and hydrogeological indices (Case study: Khaviz oilfield)

Recognition of growth pattern and folding mechanism in the fold-thrust belts with hydrocarbon resources is important in exploration and development planning of oilfields. As the processes of tectonics, erosion, and geomorphology impact on each other, therefore, the investigation of a process, one can obtain information about the other process. In this research the tectonic process of transverse...

متن کامل

Scattering Study of Conductive-Dielectric Nano/Micro-Grained Single Crystals Based on Poly(ethylene glycol), Poly(3-hexyl thiophene) and Polyaniline

Two types of rod-coil block copolymers including poly(3-hexylthiophene)-block-poly(ethylene glycol) (P3HT-b-PEG) and PEG-block-polyaniline (PANI) were synthesized using Grignard metathesis polymerization, Suzuki coupling, and interfacial polymerization. Afterward, two types of single crystals were grown by self-seeding methodology to investigate the coily and rod blocks in grafted brushes and o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012